Untying RMS from Application Scheduling
نویسندگان
چکیده
As both resources and applications are becoming more complex, resource management also becomes a more challenging task. For example, scheduling code-coupling applications on federations of clusters such as Grids results in complex resource selection algorithms. The abstractions provided by current Resource Management Systems (RMS)—usually rigid jobs or advance reservations—are insufficient to enable such applications to efficiently select resources. This paper studies an RMS architecture that delegates resource selection to applications while the RMS still keeps control over the resources. The proposed architecture is evaluated using a simulator which is then validated with a proof-of-concept implementation. Results show that such a system is feasible and performs well with respect to fairness and scalability. Key-words: RMS; scheduling; resource selection; federation of clusters; grid computing; in ria -0 05 19 86 4, v er si on 1 21 S ep 2 01 0 Externalisation de l’ordonnancement des applications des gestionnaires de ressources Résumé : Comme les ressources ainsi que les applications deviennent de plus en plus complexes, la gestion des ressources devient également plus complexe. Par exemple, l’ordonnancement d’application à base de couplage de code sur une fédération des grappes, comme par exemples les grilles, demande des algorithmes complexes pour la sélection de ressources. Les abstractions offertes par les gestionnaires de ressources (RMS—Resource Management Systems)—les tâches rigide ou les réservations en avance—sont insuffisantes pour que de telles applications puissent sélectionner les ressources d’une manière efficace. Cet article s’intéresse à une architecture RMS qui délègue la sélection des ressources aux lanceurs d’applications mais qui continue de garder le contrôle des ressources. L’architecture proposée est évaluée avec des simulations, qui sont validées avec un prototype. Les résultats montrent qu’un tel système est faisable et qu’il se comporte bien vis à vis de l’extensibilité et de l’équité. Mots-clés : Gestionnaire de ressources; ordonnancement; sélection des ressources; fédérations des grappes; grilles; in ria -0 05 19 86 4, v er si on 1 21 S ep 2 01 0 Untying RMS from Application Scheduling 3
منابع مشابه
An Efficient RMS Admission Control and its Application to Multiprocessor Scheduling - Parallel Processing Symposium, 1998, and Symposium on Parallel and Distributed Processing 1998. 19
A real-time system must execute functionally correct computations in a timely mannel: In order to guarantee that all tasks accepted in the system will meet their timing requirements, an admission control algorithm must be used to only accept tasks whose requirements can be satisfied. Rate-monotonic scheduling (RMS) is arguably the best known scheduling policy for periodic real-time tasks on uni...
متن کاملAn Efficient RMS Admission Control and Its Application to Multiprocessor Scheduling
A real-time system must execute functionally correct computations in a timely manner. In order to guarantee that all tasks accepted in the system will meet their timing requirements, an admission control algorithm must be used to only accept tasks whose requirements can be satisfied. Rate-monotonic scheduling (RMS) is arguably the best known scheduling policy for periodic real-time tasks on uni...
متن کاملCost-Effective Provisioning and Scheduling of Deadline-Constrained Applications in Hybrid Clouds
In order to meet distributed application deadlines, Resource Management Systems (RMSs) have to utilize additional resources from public Cloud providers when in-house resources cannot cope with the demand of the applications. As a means to enable this feature, called Cloud Bursting, the RMS has to be able to determine when, how many, and for how long such resources are required and provision the...
متن کاملDistributed Real-Time System Design: Theoretical Concepts and Applications
Distributed real-time system design raises new theoretical issues and application challenges, beyond those of centralized systems. Rate monotonic scheduling (RMS) theory has been successfully applied in the scheduling of centralized systems. RMS and its generalizations have been adopted by national high technology projects such as the Space Station and has recently been supported by major open ...
متن کاملChapter 7 a Systematic Approach to Designing Distributed Real-time Systems 1
Distributed real-time system design raises new theoretical issues and application challenges beyond those in centralized systems. Rate monotonic scheduling (RMS) theory has been applied successfully in the scheduling of centralized systems. RMS and its generalizations have been adopted by national high-technology projects such as the Space Station and has recently been supported by major open s...
متن کامل